A New Method for Testing Decision Procedures in Modal and Terminological Logics

Building Decision Procedures for Modal Logics from Propositional Decision Procedure - The Case Study of Modal K

The goal of this paper is to propose a new technique for developing decision procedures for propositional modal logics. The basic idea is that propositional modal decision procedures should be developed on top of propositional decision procedures. As a case study, we describe an algorithm, based on an implementation of the Davis-Putnam-Longemann-Loveland procedure, which tests satissability in ...

A New Method for Testing Decision Procedures in Modal Logics

A New Very-General Method to Generate Random Modal Formulae for Testing Decision Procedures

The recent emergence of heavily-optimized modal decision procedures has highlighted the key role of empirical testing in this domain. Unfortunately, the introduction of extensive empirical tests for modal logics is recent, and so far none of the proposed test generators is very satisfactory. To cope with this fact, we present a new random generation method that provides benefits over previous m...

A new method for bounding the complexity

We present a new proof-theoretic approach to bounding the complexity of the decision problem for propositional modal logics. We formalize logics in a uniform way as sequent systems and then restrict the structural rules for particular systems. This, combined with an analysis of the accessibility relation of the corresponding Kripke structures, yields decision procedures with bounded space requi...

A New Space Bound for the Modal Logics

We propose so called clausal tableau systems for the common modal logics K4, KD4 and S4. Basing on these systems, we give more efficient decision procedures than those hitherto known for the considered logics. In particular space requirements for our logics are reduced from the previously established bound O(n. logn) to O(n. logn).